Rough Relation Algebras Revisited

نویسندگان

  • Ivo Düntsch
  • Michael Winter
چکیده

Rough relation algebras arise from Pawlak’s information systems by considering as object ordered pairs on a fixed set X . Thus, the subsets to be approximated are binary relations over X , and hence, we have at our disposal not only the set theoretic operations, but also the relational operators ; , ̆ , and the identity relation 1′. In the present paper, which is a continuation of [6], we further investigate the structure of abstract rough relation algebras.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discrete Duality for Rough Relation Algebras

Rough relation algebras are a generalization of relation algebras such that the underlying lattice structure is a regular double Stone algebra. Standard models are algebras of rough relations. A discrete duality is a relationship between classes of algebras and classes of relational systems (frames). In this paper we prove a discrete duality for a class of rough relation algebras and a class of...

متن کامل

On Connections between Information Systems, Rough Sets and Algebraic Logic

In this note we remark upon some relationships between the ideas of an approximation space and rough sets due to Pawlak ([9] and [10]) and algebras related to the study of algebraic logic — namely, cylindric algebras, relation algebras, and Stone algebras. The paper consists of three separate observations. The first deals with the family of approximation spaces induced by the indiscernability r...

متن کامل

Rough relation

Rough relation algebras arise from Pawlak’s information systems by considering as object ordered pairs on a fixed set X . Thus, the subsets to be approximated are binary relations over X , and hence, we have at our disposal not only the set theoretic operations, but also the relational operators ; , ̆ , and the identity relation 1′. In the present paper, which is a continuation of [6], we furth...

متن کامل

Rough relation algebras1,2

Rough relation algebras were introduced by S. Comer as a generalisation of algebras of Pawlak's rough sets and Tarski's relation algebras. In this paper, some algebraic and arithmetical properties of rough relation algebras are studied and the representable rough relation algebras are characterised. 1. Definitions and preliminary results We assume that the reader is familiar with the basic fact...

متن کامل

Constructive and Algebraic Methods of the Theory of Rough Sets

This paper reviews and compares constructive and algebraic approaches in the study of rough sets. In the constructive approach, one starts from a binary relation and defines a pair of lower and upper approximation operators using the binary relation. Different classes of rough set algebras are obtained from different types of binary relations. In the algebraic approach, one defines a pair of du...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Fundam. Inform.

دوره 74  شماره 

صفحات  -

تاریخ انتشار 2006